Distributed Places
نویسندگان
چکیده
Distributed Places bring new support for distributed, message-passing parallelism to Racket. This paper gives an overview of the programming model and how we had to modify our existing, runtime-system to support distributed places. We show that the freedom to design the programming model helped us to make the implementation tractable. The paper presents an evaluation of the design, examples of higher-level API’s that can be built on top of distributed places, and performance results of standard parallel benchmarks.
منابع مشابه
A Uniform Approach toProgramming the World Wide
We propose a uniform model for programming distributed web applications. The model is based on the concept of web computation places and provides mechanisms to coordinate distributed computations at these places, including peer-to-peer communication between places and a uniform mechanism to initiate computation in remote places. Computations can interact with the ow of http requests and respons...
متن کاملDistributed Generation Expansion Planning Considering Load Growth Uncertainty: A Novel Multi-Period Stochastic Model
Abstract – Distributed generation (DG) technology is known as an efficient solution for applying in distribution system planning (DSP) problems. Load growth uncertainty associated with distribution network is a significant source of uncertainty which highly affects optimal management of DGs. In order to handle this problem, a novel model is proposed in this paper based on DG solution, consideri...
متن کاملPrinciples of Distributed Computing 04 / 12 , 2017 Lecture
In this lecture, we discuss sublinear-time centralized algorithms for graph problems. As we shall see soon, the core part of these algorithms is a local procedure, quite similar to the LOCAL distributed algorithms that we have been discussing over the past few lectures. Sublinear-time (centralized) algorithms are gaining importance with the constant increase in the size of the graph problems th...
متن کاملPrinciples of Distributed Computing 1 Approximating Maximum Matching
In this lecture, we discuss sublinear-time centralized algorithms for graph problems. As we shall see soon, the core part of these algorithms is a local procedure, quite similar to the LOCAL distributed algorithms that we have been discussing over the past few lectures. Sublinear-time (centralized) algorithms are gaining importance with the constant increase in the size of the graph problems th...
متن کاملEWFN - A Petri Net Dialect for Tuplespace-Based Workflow Enactment
Petri nets are a formalism for describing systems where interactions between active components – so-called transitions – are modeled as exchanges of tokens over passive places. Whether a transition may fire is solely dependent on the availability of tokens in its incoming places; similarly a transition forwards control to subsequent transitions by storing tokens in their respective input places...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013